Equational Constructor Induction
نویسندگان
چکیده
We propose an extension of purely equational reasoning with an induction rule, to obtain an intermediate between the equational theory of an algebraic specification and its !-closure.
منابع مشابه
Automated Induction for Complex Data Structures
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values), and may express syntactic equality, disequality, ordering and also membership in a fixed tree language. Constrained equational axioms between constructor ter...
متن کاملAutomated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values), and may express syntactic equality, disequality, ordering and also membership in a fixed tree language. Constrained equational axioms between constructor ter...
متن کاملA technique for automatically proving termination of constructor systems
A technique is described to prove termination of constructor systems (CSs) automatically. The technique consists of three major steps. First, determine the dependency pairs of a constructor system. Second, nd an equational theory in which the constructor system is contained, and third, prove that no in nite chain w.r.t. the equational theory of these dependency pairs exists. The rst step is eas...
متن کاملAdjoint Rewriting and the !-type Constructor
This paper provides a sound, complete and decidable equational theory for the terms of the (I; ;?;!)-fragment of intuitionistic linear logic with respect to the class of models known as linear categories. This work uses the natural deduction style presentation of the !-type constructor in DILL so as to be able to apply the ideas of adjoint rewriting. We obtain an expansionary-rewrite rule and c...
متن کاملA Narrowing-Based Theorem Prover
This work presents a theorem prover for inductive proofs within an equational theory which supports the verification of universally quantified equations. This system, called TIP, is based on a modification of the well-known narrowing algorithm. Particulars of the implementation are stated and practical experiences are summarized. Equational axiomatic specifications are now widely accepted as a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 25 شماره
صفحات -
تاریخ انتشار 1996